A theorem in edge colouring
نویسنده
چکیده
We prove the following theorem: if G is an edge-chromatic critical multigraph with more than 3 vertices, and if x, y are two adjacent vertices of G, the edge-chromatic number of G does not change if we add an extra edge joining x and y.
منابع مشابه
Facial parity edge colouring
The facial parity edge colouring of a connected bridgeless plane graph is such an edge colouring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same colour, in addition, for each face α and each colour c, either no edge or an odd number of edges incident with α is coloured with c. From the Vizing’s theorem it follows that every 3-connected plan...
متن کاملEdge Cover Colouring Versus Minimum Degree in Multigraphs
An edge colouring of a multigraph can be thought of as a partition of the edges into matchings (a matching meets each vertex at most once). Analogously, an edge cover colouring is a partition of the edges into edge covers (an edge cover meets each vertex at least once). We aim to determine a tight lower bound on the maximum number of parts in an edge cover colouring as a function of the minimum...
متن کاملStrong edge-colouring and induced matchings
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of three edges uses three colours. An induced matching of a graph G is a subset I of edges of G such that the graph induced by the endpoints of I is a matching. In this paper, we prove the NP-completeness of strong 4, 5, and 6-edge-colouring and maximum induced matching in some subclasses of subcubic triangle-f...
متن کاملStrong edge-colouring of sparse planar graphs
A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree∆ has a strong edge-colouring with at most 4∆ + 4 colours. We show that 3∆ + 1 colours suffice if the graph has girth 6, and 4∆ colours suffice if ∆ ≥ 7 or the girth is at least 5. In the last part of the paper, we raise some questions ...
متن کاملSome graph classes satisfying acyclic edge colouring conjecture
We present some classes of graphs which satisfy the acyclic edge colouring conjecture which states that any graph can be acyclically edge coloured with at most ∆ + 2 colours.
متن کاملThe Adaptable Chromatic Number and the Chromatic Number
We prove that the adaptable chromatic number of a graph is at least asymptotic to the square root of the chromatic number. This is best possible. Consider a graph G where each edge of G is assigned a colour from {1, ..., k} (this is not necessarily a proper edge colouring). A k-adapted colouring is an assignment of colours from {1, ..., k} to the vertices of G such that there is no edge with th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009